Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices
نویسندگان
چکیده
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملOn extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices
The problem of determining the smallest number of edges, h(n;κ ≥ r), which guarantees that any graph with n vertices and h(n;κ ≥ r) edges will contain a pair of vertices joined by r internally disjoint paths was posed by Erdös and Gallai. Bollobás considered the problem of determining the largest number of edges f(n;κ ≤ `) for graphs with n vertices and local connectivity at most `. One can see...
متن کاملThree-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices
It is known that every closed compact orientable 3-manifold M can be represented by a 4-edge-coloured 4-valent graph called a crystallisation of M. Casali and Grasselli proved that 3-manifolds of Heegaard genus g can be represented by crystallisations with a very simple structure which can be described by a 2(g +1)-tuple of non-negative integers. The sum of first g +1 integers is called complex...
متن کاملExtremal Values of Merrifield-simmons Index for Trees with Two Branching Vertices
In this paper we find trees with minimal and maximal MerrifieldSimmons index over the set Ω (n, 2) of all trees with n vertices and 2 branching vertices, and also over the subset Ω (n, 2) of all trees in Ω (n, 2) such that the branching vertices are connected by the path Pt.
متن کاملThe Hyper-Zagreb Index of Trees and Unicyclic Graphs
Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2946131